A unified method of detecting core-periphery structure and community structure in networks
نویسندگان
چکیده
منابع مشابه
A Unified Method of Detecting Core-Periphery Structure and Community Structure in Networks
The core-periphery structure and the community structure are two typical meso-scale structures in complex networks. Although community detection has been extensively investigated from different perspectives, the definition and the detection of the core-periphery structure have not received much attention. Furthermore, the detection problems of the core-periphery and community structure were sep...
متن کاملCore-Periphery Structure in Networks
Intermediate-scale (or “meso-scale”) structures in networks have received considerable attention, as the algorithmic detection of such structures makes it possible to discover network features that are not apparent either at the local scale of nodes and edges or at the global scale of summary statistics. Numerous types of meso-scale structures can occur in networks, but investigations of such f...
متن کاملIdentification of core-periphery structure in networks
Many networks can be usefully decomposed into a dense core plus an outlying, loosely connected periphery. Here we propose an algorithm for performing such a decomposition on empirical network data using methods of statistical inference. Our method fits a generative model of core-periphery structure to observed data using a combination of an expectation-maximization algorithm for calculating the...
متن کاملStructure and dynamics of core/periphery networks
Recent studies uncovered important core/periphery network structures characterizing complex sets of cooperative and competitive interactions between network nodes, be they proteins, cells, species or humans. Better characterization of the structure, dynamics and function of core/periphery networks is the key step to our understanding of cellular functions, species adaptation, social and market ...
متن کاملDetecting community structure in networks
There has been considerable recent interest in algorithms for finding communities in networks— groups of vertices within which connections are dense, but between which connections are sparser. Here we review the progress that has been made towards this end. We begin by describing some traditional methods of community detection, such as spectral bisection, the Kernighan–Lin algorithm and hierarc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science
سال: 2018
ISSN: 1054-1500,1089-7682
DOI: 10.1063/1.4990734